THE NUMBER OF GRAPHS AND A RANDOM GRAPH WITH A GIVEN DEGREE SEQUENCE Alexander Barvinok and J.A. Hartigan November 2011 Abstract. We consider the set of all graphs on n labeled vertices with prescribed

Source URL: www.math.lsa.umich.edu

• Mathematics
• Mathematical analysis
• Central limit theorem
• Regular graph
• Matrix
• Entropy
• Number theory
• Graph coloring
• Discriminant of an algebraic number field
• Differential forms on a Riemann surface

CANT 2016 Abstracts New York Number Theory Seminar Fourteenth Annual Workshop on Combinatorial and Additive Number Theory CUNY Graduate Center May 24–27, 2016

Source URL: www.theoryofnumbers.com

Analysis of BKZ Guillaume Hanrot, Xavier Pujol, Damien Stehl´e ENSL, LIP, CNRS, INRIA, Universit´ e de Lyon, UCBL May 5, 2011

Source URL: caramba.loria.fr

• Mathematics
• Geometry
• Algebra
• Lie groups
• Lattice points
• Linear algebra
• Computational number theory
• Lattice reduction
• Crystallography
• Lattice
• Hermite constant
• Crystal structure

EXAMPLE SHEET 1 FOR CAMBRIDGE PART III COURSE ON “PROBABILISTIC NUMBER THEORY”, MICHAELMAS 2015 ADAM J HARPER These questions cover some of the material from sections 1–6 of the lecture notes, as well as general ba

Source URL: www.dpmms.cam.ac.uk

Paranoid Proof-Number Search Jahn-Takeshi Saito and Mark H.M. Winands Abstract— Over the years, an increasing number of twoplayer games has been added to the list of solved games. However, solving multi-player games ha

Source URL: game.itu.dk

• Game artificial intelligence
• Search algorithms
• Combinatorial game theory
• Proof-number search
• Abstract strategy games
• Andor tree
• Alphabeta pruning
• Game tree
• Solved game
• Tree
• B-tree
• Computer chess

Elementary Aspects of the Verlinde Formula and of the Harder-Narasimhan-Atiyah-Bott Formula Don Zagier

Source URL: people.mpim-bonn.mpg.de

• Mathematical analysis
• Mathematics
• Analysis
• Orthogonal polynomials
• Integer sequences
• Polynomials
• Approximation theory
• Chebyshev polynomials
• Generating function
• Bessel function
• Bernoulli number
• Binomial coefficient

GRADUATE SEMINAR SPRING 2007 PROBLEM SET 1 JONATHAN LETO 1. Problem 1 Show that for ai > 0, pi > 0 p

Source URL: leto.net

• Zeta
• Mathematics
• Generalized functions
• Algebraic number theory
• Complete quotient

The (λ, κ)-FN and the order theory of bases in boolean algebras David Milovich Texas A&M International University http://www.tamiu.edu/∼dmilovich/

Source URL: spot.colorado.edu

• Large cardinals
• Mathematical logic
• Mathematics
• Abstraction
• Cardinal number
• Free Boolean algebra
• Model theory
• Mahlo cardinal
• Weakly compact cardinal

A MODIFIED BERNOULLI NUMBER D. Zagier The classical Bernoulli numbers Bn , defined by the generating function ∞

Source URL: people.mpim-bonn.mpg.de

• Mathematical analysis
• Mathematics
• Number theory
• Integer sequences
• Meromorphic functions
• Combinatorics
• Polynomials
• Bernoulli polynomials
• Bernoulli number
• Riemann zeta function
• Bessel function
• Transcendental number

ON COMBINATORIAL WEAKNESSES OF RAMSEYAN PRINCIPLES LUDOVIC PATEY ABSTRACT. Avoidance properties such as cone avoidance or PA avoidance for a principle P in reverse mathematics shows the effectiveness weakness of P. Stron

Source URL: ludovicpatey.com

• Computability theory
• Theory of computation
• Computable number
• Computable function
• 01 class
• Computation in the limit